Adaptive Filtering: Standard LMS vs. Darwinian Algorithm

نویسنده

  • Jurij F. Tasič
چکیده

In this paper we concentrate on the problem of comparing the effectiveness of the Darwinian, and Least Square methods, with the influence of the input signal (statistics) spreadness highlighted. Our approach in this paper is to carry out an extensive suite of simulations for both the Darwinian algorithm and LMS algorithm under varying initial conditions and eigenvalue spread of the signal autocorrelation matrix. Considerable progress in understanding the relative merits of LMS and Darwinian results from this comparison, and it is shown that the Darwinian approach yields respectable results. The main promise for improved flexibility lies when supplementary goodness criteria are appended; some preliminary treatment of this "multicriterion" extension to the normal adaptive problem is included.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speech Enhancement by Modified Convex Combination of Fractional Adaptive Filtering

This paper presents new adaptive filtering techniques used in speech enhancement system. Adaptive filtering schemes are subjected to different trade-offs regarding their steady-state misadjustment, speed of convergence, and tracking performance. Fractional Least-Mean-Square (FLMS) is a new adaptive algorithm which has better performance than the conventional LMS algorithm. Normalization of LMS ...

متن کامل

A Family of Selective Partial Update Affine Projection Adaptive Filtering Algorithms

In this paper we present a general formalism for the establishment of the family of selective partial update affine projection algorithms (SPU-APA). The SPU-APA, the SPU regularized APA (SPU-R-APA), the SPU partial rank algorithm (SPU-PRA), the SPU binormalized data reusing least mean squares (SPU-BNDR-LMS), and the SPU normalized LMS with orthogonal correction factors (SPU-NLMS-OCF) algorithms...

متن کامل

Architectural Synthesis of Low-Power Computational Engines for LMS Adaptive Filtering

The stochastic-gradient-descent LMS adaptive filtering algorithm provides a powerful and computationally efficient means of realizing adaptive filters. In this work, we present architectural synthesis of low-power computational engines (or hardware accelerators) for LMS adaptive filtering. This engine could be configured for delayed LMS/delayed normalized LMS, full-band/subband adaptive filteri...

متن کامل

Gradient Compared Lp-LMS Algorithms for Sparse System Identification

In this paper, we propose two novel p-norm penalty least mean square (lp-LMS) algorithms as supplements of the conventional lp-LMS algorithm established for sparse adaptive filtering recently. A gradient comparator is employed to selectively apply the zero attractor of p-norm constraint for only those taps that have the same polarity as that of the gradient of the squared instantaneous error, w...

متن کامل

Improving the Response of Accelerometers for Automotive Applications by Using LMS Adaptive Filters: Part II

In this paper, the fast least-mean-squares (LMS) algorithm was used to both eliminate noise corrupting the important information coming from a piezoresisitive accelerometer for automotive applications, and improve the convergence rate of the filtering process based on the conventional LMS algorithm. The response of the accelerometer under test was corrupted by process and measurement noise, and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002